Separation and Lifting of TSP inequalities
نویسنده
چکیده
The problem of separating a class of TSP inequalities consists in devising a method that, given a fractional point x for a relaxation of the TSP, either nds an inequality in the given class of TSP inequalities that is violated by x or determines that there are no such violated inequalities. Both heuristic and exact e cient separation algorithms are sought after so that we can more easily solve TSP instances when using a cutting plane approach such as branch-and-cut. We present e cient methods for exactly separating over very large classes of TSP inequalities. These inequality classes arise from node lifting familiar TSP inequalities.
منابع مشابه
The Symmetric Traveling Salesman Polytope Revisited
We propose in this paper a tour of the symmetric traveling salesman polytope, focusing on inequalities that can be deened on sets. The most known inequalities are all of this type. Many papers have appeared which give more and more complex valid inequalities for this polytope, but no intuitive idea on why these inequalities are valid has ever been given. In order to help in understanding these ...
متن کاملLifting Cover Inequalities for the Binary Knapsack Polytope
We consider the family of facets of the binary knapsack polytope from minimal covers. We study previous results on sequential lifting in a unifying framework and explore a class of most violated fractional lifted cover inequalities, defined by Balas and Zemel, which are more general than traditional simple lifted cover inequalities. We investigate some theoretical properties of these inequaliti...
متن کاملOn Splittable and Unsplittable Ow Capacitated Network Design Arc{set Polyhedra
We study the polyhedra of splittable and unsplittable arc sets of multicommodity ow capac-itated network design problems. We investigate the optimization problems over these polyhedra and the separation and lifting problems of valid inequalities for them. In particular, we give a linear-time separation algorithm for the residual capacity inequalities (Magnanti et al., 1993) and show that the se...
متن کاملMathematical Programming Manuscript No. on Splittable and Unsplittable Ow Capacitated Network Design Arc{set Polyhedra
We study the polyhedra of splittable and unsplittable single arc{set relaxations of multicommodity ow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear{time separation algorithm for the residual capacity inequalities 19] and show that the separation...
متن کاملThe 0-1 Knapsack problem with a single continuous variable
Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing knapsack separation routines cannot be used on such constraints. Here we study such constraint sets, and derive valid inequalities that can be used as cuts for such sets, as well for more general mixed 0-1 constraints. Specifically we investigate the polyhedral structure ...
متن کامل